Adaptive scalar quantization without side information

Adaptive Quantization without Side Information 1

Adaptive Scalar Quantization Without Side Information - Image Processing, IEEE Transactions on

In this paper, we introduce a novel technique for adaptive scalar quantization. Adaptivity is useful in applications, including image compression, where the statistics of the source are either not known a priori or will change over time. Our algorithm uses previously quantized samples to estimate the distribution of the source, and does not require that side information be sent in order to adap...

Locally - Adaptive Perceptual Quantization without Side Informationfor DCT

Existing JPEG/MPEG compliant perceptual coding methods do not fully exploit the local variation of perceptual masking thresholds. This work demonstrates that, for natural images with the same perceptual quality, the rst-order entropy of the quantizer outputs can be reduced by 15 to 40 percent when optimal locally-adaptive perceptual quantization is used. Locally-adaptive perceptual quantization...

Lattice Quantization with Side Information

We consider the design of lattice vector quantizers for the problem of coding Gaussian sources with uncoded side information available only at the decoder. The design of such quantizers can be reduced to the problem of nding an appropriate sublattice of a given lattice codebook. We study the performance of the resulting quantizers in the limit as the encoding rate becomes high, and we evaluate ...

Image Adaptive High Volume Data Hiding Based on Scalar Quantization

Information-theoretic analysis for data hiding prescribe embedding the hidden data in the choice of quantizer for the host data. In this paper, we consider a suboptimal implementation of this prescription, with a view to hiding high volumes of data in images with low perceptual degradation. The three main findings are as follows: (i) Scalar quantization based data hiding schemes incur about 2 d...